Estimating Change Point in Single Server Queues

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

stationary single-server queues

This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...

متن کامل

Fairness and Scheduling in Single Server Queues

Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...

متن کامل

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server’s movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The se...

متن کامل

Some Inequalities for Single Server Queues

The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...

متن کامل

Infinite Server Queues with Synchronized Departures Driven by a Single Point Process

We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {Tn} according to the following rules. At time Tn, a single customer (or a batch of size βn) arrives to the system. The service requirement of the ith customer in the nth batch is σi,n. All customers enter service immediately upon arrival but each customer leaves the system at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics and Statistics

سال: 2016

ISSN: 2332-2071,2332-2144

DOI: 10.13189/ms.2016.040103